#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
char s[maxn];
char t[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,k;cin>>n>>k;
  cin>>(s+1);
  for(LL i=1;i<=n;i++){
    t[i]=s[n-i+1];
  }
  /*
  for(LL i=n+1;i<=2*n;i++){
    s[i]=t[i-n];
  }
  if(k%(2*n)==0){
    cout<<s[2*n]<<"\n";
  }
  else cout<<s[(k%(2*n))]<<"\n";

  for(LL i=1;i<=n;i++){
    t[i]=s[n-i+1];
  }*/
  LL t1;
  if(k%n==0){
    t1=k/n;
  }
  else{
    t1=k/n+1;
  }
  ///LL t1=(LL)ceil(1.0*k/(1.0*n));
  LL t2=k%n;
  if(t1&1){
    ///cout<<"fuck"<<"\n";
    if(t2==0){
        cout<<s[n]<<"\n";
    }
    else{
        cout<<s[t2]<<"\n";
    }
  }
  else if(t1%2==0){
    if(t2==0){
        cout<<t[n]<<"\n";
    }
    else cout<<t[t2]<<"\n";
  }

return 0;
}
